|
In combinatorics, the twelvefold way is a name given to a systematic classification of 12 related enumerative problems concerning two finite sets, which include the classical problems of counting permutations, combinations, multisets, and partitions either of a set or of a number. The idea of the classification is credited to Gian-Carlo Rota, and the name was suggested by Joel Spencer.〔Richard P. Stanley (1997). (''Enumerative Combinatorics, Volume I'' ). Cambridge University Press. ISBN 0-521-66351-2. p.41〕 == Overview == Let and be finite sets. Let and be the cardinality of the sets. Thus is an -set, and is an -set. The general problem we consider is the enumeration of equivalence classes of functions . The functions are subject to one of the three following restrictions: # No condition: each in may be sent by to any in , and each may occur multiple times. # is injective: each value for in must be distinct from every other, and so each in may occur at most once in the image of . # is surjective: for each in there must be at least one in such that , thus each will occur at least once in the image of . A possible fourth condition of being bijective is not included, since it doesn't add any new problems (the set of such functions will be empty unless , in which case the condition is both equivalent to being injective and equivalent to being surjective). There are four different equivalence relations which may be defined on the set of functions from to : # equality; # equality up to a permutation of ; # equality up to a permutation of ; # equality up to permutations of and . Any of these equivalence relations produces a decomposition of the set of functions into equivalence classes. (An equivalence class is the orbit of a function under the group action considered: , or , or , or , where is the symmetric group of ''N'', and is the symmetric group of ''X''.) The three conditions on the functions and the four equivalence relations can be paired in 3 × 4 = 12 ways. The twelve problems of counting equivalence classes of functions do not involve the same difficulties, and there is not one systematic method for solving them. Two of the problems are trivial (the number of equivalence classes is 0 or 1), five problems have an answer in terms of a multiplicative formula of ''n'' and ''x'', and the remaining five problems have an answer in terms of combinatorial functions (Stirling numbers and the partition function for a given number of parts). The incorporation of classical enumeration problems into this setting is as follows. * Counting ''n''-permutations (i.e., partial permutations or sequences without repetition) of ''X'' is equivalent to counting injective functions ''N'' → ''X''. * Counting ''n''-combinations of ''X'' is equivalent to counting injective functions ''N'' → ''X'' up to permutations of ''N''. * Counting permutations of the set ''X'' is equivalent to counting injective functions ''N'' → ''X'' when ''n'' = x, and also to counting surjective functions ''N'' → ''X'' when ''n'' = ''x''. * Counting multisets of size ''n'' (also known as ''n''-combinations with repetitions) of elements in ''X'' is equivalent to counting all functions ''N'' → ''X'' up to permutations of ''N''. * Counting partitions of the set ''N'' into ''x'' subsets is equivalent to counting all surjective functions ''N'' → ''X'' up to permutations of ''X''. * Counting compositions of the number ''n'' into ''x'' parts is equivalent to counting all surjective functions ''N'' → ''X'' up to permutations of ''N''. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「twelvefold way」の詳細全文を読む スポンサード リンク
|